Multi-objective flow shop scheduling using hybrid simulated annealing

نویسندگان

  • Ashwani Dhingra
  • Pankaj Chandna
چکیده

Purpose – In order to achieve excellence in manufacturing, goals like lean, economic and quality production with enhanced productivity play a crucial role in this competitive environment. It also necessitates major improvements in generally three primary technical areas: variation reduction, equipment reliability, and production scheduling. Complexity of the real world scheduling problems also increases with interactive multiple decision-making criteria. This paper aims to deal with multi-objective flow shop scheduling problems, including sequence dependent set up time (SDST). The paper also aims to consider the objective of minimizing the weighted sum of total weighted tardiness, total weighted earliness and makespan simultaneously. It proposes a new heuristic-based hybrid simulated annealing (HSA) for near optimal solutions in a reasonable time. Design/methodology/approach – Six modified NEH’s based HSA algorithms are proposed for efficient scheduling of jobs in a multi-objective SDST flow shop. Problems of up to 200 jobs and 20 machines are tested by the proposed HSA and a defined relative percentage improvement index is used for analysis and comparison of different MNEH’s based hybrid simulated annealing algorithms. Findings – From the results, it has been derived that performance of SA_EWDD (NEH) up to ten machines’ problems, and SA_EPWDD (NEH) up to 20 machines’ problems, were better over others especially for large sized SDST flow shop scheduling problems for the considered multi-objective fitness function. Originality/value – HSA and multi-objective decision making proposed in the present work is a modified approach in the area of SDST flow shop scheduling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...

متن کامل

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

An algorithm for multi-objective job shop scheduling problem

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

متن کامل

Hybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010